A multi-objective scheduling algorithm for multi-mode resource constrained projects in the presence of uncertain resource availability

Goal: The issue of resource allocation is a major concern for project engineers in the scheduling process project. Resources over-allocation are often seen practice after project, which makes unhelpful. Modifying an over-allocated schedule very complicated and requires lot effort time. Besides, during resource-constrained projects constructing companies, managers should more than one objective at same This research aims to propose new heuristic algorithm minimizing completion time, cost or maximizing quality execution activities simultaneously while multi-mode taken into consideration. Design / Methodology Approach: In this research, method proposed solving multi-objective problem constrained problems (MRCPSPs) where aim net present value (NPV) minimize time maximize executing along with emerging uncertainty resources availability activity durations. then coded by Matlab® 2016. Results: outcomes small, medium large scale case studies, following results achieved: (i) could solve all different circumstances no difficulties; (ii) (with 200 activities, 20 3 modes each activity) be solved 4.43 seconds. (iii) none studied cases problem. can considered among fastest algorithms found literature. addition, it that makespan, NPV have co-relation must consideration process. Limitations investigation: main limitations only covers scheduling. Moreover, risk factors associated objectives yet addressed future studies. Practical implications: performance validated using 24 series dataset order verify its real practice, has been applied part construction Malaysia. indicated scheduled 23 5 2 less second over-allocations. allows consider NPV, provide better atmosphere they process. Originality Value: original great studies preventing constraint help find near optimum solutions complex faster also accuracy.